Search for: All records

Complex systems across various domains can be naturally modeled as signed networks with positive and negative edges. In this work, we design a new class of signage models and show how to select the model parameters that best fit real-world datasets using maximum likelihood. 

Signed networks (networks with positive and negative edges) commonly arise in various domains from molecular biology to social media. The edge signs -- i.e., the graph signage -- represent the interaction pattern between the vertices and can provide insights into the underlying system formation process. Generative models considering signage formation are essential for testing hypotheses about the emergence of interactions and for creating synthetic datasets for algorithm benchmarking (especially in areas where obtaining real-world datasets is difficult).In this work, we pose a novel Maximum-Likelihood-based optimization problem for modeling signages given their topology and showcase it in the context of gene regulation. Regulatory interactions of genes play a key role in the process of organism development, and when broken can lead to serious organism abnormalities and diseases. Our contributions are threefold: First, we design a new class of signage models for a given topology, and, based on the parameter setting, we discuss its biological interpretations for gene regulatory networks (GRNs). Second, we design algorithms computing the Maximum Likelihood -- depending on the parameter setting, our algorithms range from closed-form expressions to MCMC sampling. Third, we evaluated the results of our algorithms on synthetic datasets and real-world large GRNs. Our work can lead to the prediction of unknown gene regulations, novel biological hypotheses, and realistic benchmark datasets in the realm of gene regulation. 

Stable matching models are widely used in market design, school admission, and donor organ exchange. The classic Deferred Acceptance (DA) algorithm guarantees a stable matching that is optimal for one side (say men) and pessimal for the other (say women). A sex-equal stable matching aims at providing a fair solution to this problem. We demonstrate that under a class of correlated preferences, the DA algorithm either returns a sex-equal solution or has a very low sex-equality cost. 

Assignments based on meaningful real-world contexts have been shown to be valuable in introductory computing education. However, it can be difficult to distinguish the value of a broad context from the value of a particular instantiation of that context. In this work in progress, we report on our initial findings gathered from deployments of different pencil-puzzle-based assignments. Specifically, we have investigated the use of pencil puzzles as a contextual domain, working with instructors at eight institutions to deliver assignments appropriate to their situation and aligning with their existing materials. We then evaluate the assignments using student grades and survey responses regarding student perceptions of the assignments including self-assessed learning, given a wide array of demographic variables. Our initial results show that while there was some dependency of student responses on their prior programming experience, and female students’ feedback were more positive about one aspect, overall these types of assignments do not appear to put particular groups of students at a strong (dis)advantage. 

The ability of wild animals to navigate and survive in complex and dynamic environments depends on their ability to store relevant information and place it in a spatial context. Despite the centrality of spatial memory, and given our increasing ability to observe animal movements in the wild, it is perhaps surprising how difficult it is to demonstrate spatial memory empirically. We present a cognitive analysis of movements of several wolves ( Canis lupus ) in Finland during a summer period of intensive hunting and den-centered pup-rearing. We tracked several wolves in the field by visiting nearly all GPS locations outside the den, allowing us to identify the species, location and timing of nearly all prey killed. We then developed a model that assigns a spatially explicit value based on memory of predation success and territorial marking. The framework allows for estimation of multiple cognitive parameters, including temporal and spatial scales of memory. For most wolves, fitted memory-based models outperformed null models by 20 to 50% at predicting locations where wolves chose to forage. However, there was a high amount of individual variability among wolves in strength and even direction of responses to experiences. Some wolves tended to return to locations with recent predation success—following a strategy of foraging site fidelity—while others appeared to prefer a site switching strategy. These differences are possibly explained by variability in pack sizes, numbers of pups, and features of the territories. Our analysis points toward concrete strategies for incorporating spatial memory in the study of animal movements while providing nuanced insights into the behavioral strategies of individual predators.